On Formulations of Firing Squad Synchronization Problems
نویسندگان
چکیده
We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used is determined by the boundary condition of the general. We show that the usual formulation and the new formulation yield different minimum firing times for some variations of the problem. Our results suggest that the new formulation is more suited for the general theory of the firing squad synchronization problem.
منابع مشابه
Recursivity in Field-Based Programming: the Firing Squad Example
In cellular automata, the well-known firing squad synchronization problems have many solutions usually provided as explicit transition tables, and explained in terms of idealized continuous signals and their collision. However, very few proofs exist despite of the large amount of work on these problems. In this presentation, we take the spatial computing point of view and provide a field-based ...
متن کاملAn intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
Here is presented a 6-states non minimal-time solution which is intrinsically Minsky-like and solves the three following problems: unrestricted version on a line, with one initiator at each end of a line and the problem on a ring. We also give a complete proof of correctness of our solution, which was never done in a publication for Minsky’s solutions. 1991 Mathematics Subject Classification. 6...
متن کاملState-efficient Time-optimum Synchronization Protocols for Two-dimensional Arrays -A Survey-
The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we give a survey on recent developments in firing squad synchronization algorithms for synchronizing large-scale two-dimensional cellular automata. Several new algorithms and their stateefficient implementatio...
متن کاملThe Firing Squad Synchronization Problems for Number Patterns on a Seven-Segment Display and Segment Arrays
Citation IEICE transactions on information and systems, 93 SUMMARY The Firing Squad Synchronization Problem (FSSP), one of the most well-known problems related to cellular automata, was originally proposed by Myhill in 1957 and became famous through the work of Moore [1]. The first solution to this problem was given by Minsky and McCarthy [2] and a minimal time solution was given by Goto [3]. A...
متن کاملAbout 4-States Solutions to the Firing Squad Synchronization Problem
We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata.
متن کامل